Analysing the Security of Incentive Schemes in P2P-based File-sharing Systems
نویسنده
چکیده
For Peer-to-Peer (P2P) file-sharing services cooperation is essential. However, peers behave rationally and try to maximise their benefits, while minimising their effort. To increase system performance incentive schemes are used to enforce cooperation. Nonetheless, so called free-riders and malicious peers try to attack these incentive schemes. In this paper we will first explain two popular P2P file-sharing applications (BitTorrent and eMule), especially focusing on their incentive mechanisms. We then discuss incentive schemes in general, introducing genuine and artificial incentives and providing a taxonomy for incentives. We show that genuine incentive are regarded robust, since they are implemented directly into the service. Finally, we discuss attacks on P2P incentive schemes. We categorize the attacks in four classes: rational attacks, Denial-of-Service (DoS) attacks, ID-based attacks and collusion attacks. We show that with these attacks, it is possible to bypass incentive mechanisms and disturb P2P file-sharing services. We show that numerous attacks against BitTorrent are available and the current BitTorrent and BitTorrent private tracker incentives can be bypassed completely. We will further discover that eMule is insufficiently reasearched and few attacks exists. Finally, we introduce countermeasures, which prevent most of the analysed attacks.
منابع مشابه
P2P Network Trust Management Survey
Peer-to-peer applications (P2P) are no longer limited to home users, and start being accepted in academic and corporate environments. While file sharing and instant messaging applications are the most traditional examples, they are no longer the only ones benefiting from the potential advantages of P2P networks. For example, network file storage, data transmission, distributed computing, and co...
متن کاملAn Analysis of Incentives to Contribute in Collaborative File Sharing Environments
Projects developing infrastructure for the pooling of distributed resources (data, storage, or computation) [1, 2] often assume that resource owners have committed their resources and that the chief task is to integrate and use them efficiently. Such projects frequently ignore the question of whether individual resource owners are willing to share their personal resources for the overall good o...
متن کاملSecurity Analysis of a Hash-Based Secret Sharing Scheme
Secret sharing schemes perform an important role in protecting se-cret by sharing it among multiple participants. In 1979, (t; n) threshold secret sharing schemes were proposed by Shamir and Blakley independently. In a (t; n) threshold secret sharing scheme a secret can be shared among n partic-ipants such that t or more participants can reconstruct the secret, but it can not be reconstructed b...
متن کاملA Study of Security Patch Dissemination for Combating File-sharing Worms
Worm attacks in file-sharing applications have been terrorizing P2P networks in recent years. Existing solutions to these imminent threats are rather passive by relying on user’s individual recovery or limiting filesharing services. To be more scalable and effective in combating file-sharing worms, automated and systematic countermeasures must be developed. In this work, we study the feasibilit...
متن کاملCoalition Formation in P2P File Sharing Systems
P2P file sharing systems are distributed systems consisting of interconnected nodes able to self-organize in networks, with the purpose of sharing content. Recent empirical studies have shown that they suffer from freeloaders, that is, peers that consume many more resources or content than they contribute. In this paper we propose a coalition formation based incentive mechanism for P2P file sha...
متن کامل